"Apache" <apa### [at] yahoocom> wrote...
> I'm working on some C code that generates radiosity sample data. I want to
> have more than 1600 samples available. I have posted an image at pbi that
> I'm referring to in this post.
[clip]
> Finally I order the samples and write them to disk (see C and D in the
image
> at pbi). By ordering them, the set also is distributed the right way when
> only the first few samples are being used. (Think of count 35 etc etc
etc.)

The code you posted looks like it is on the order of O(n), unless the code
you posted is missing a "for" loop (maybe on the variable "i1").  I would
have expected the code that "moves the samples a bit around in order to
divide the samples more evenly" to be at least O(n^2).

If it realy is O(n), which would be great, couldn't you simply generate an
appropriate distribution each time, removing the need to order them.  If the
algorithm produces evenly spaced samples for small counts, this would also
ensure that small sample counts look their best.

-Nathan

Post a reply to this message